Neighbor Coverage and Bandwidth Aware Multiple Disjoint Path Discovery in Wireless Mesh Networks

With the ease of appending new nodes without re-installing whole network, Internet Things (IoT) builds several smart applications on Wireless Mesh Network (WMN). One important aspects integrating WMN and IoT is to provide an energy-efficient reliable routing protocol. Seeking communication route that delivers high-quality stream quickly over issue, but maximum utilization a single path leads poor throughput large delay, including discovery data forwarding delay. The broadcasting mechanism creates redundant transmissions control packets into network reinitializes blind process due link disconnections leading resource constraints high delay during process. Moreover, congestion in incurs transmission latency. This paper proposes Multiple Disjoint Path Determination (MDPD) based on-demand formulate Reducing neighbor list uncommon set reduces unnecessary latency discovery, deriving capacity multiple disjoint routes reduce proposed work. work employs queue dynamics queuing which mainly provides adaptability efficient diversity paths gateway node infer available bandwidth optimize traffic. To fully utilize advantage heterogeneous routers, it disables flooding across stable mesh excluding initial process, because enables storage system each router. Hence, efficiently supports wireless broadband internet access with reduced overhead. simulation results demonstrate fast detection traffic optimization discovered MDPD WMN.